Breaking 104 Bit WEP in Less Than 60 Seconds

نویسندگان

  • Erik Tews
  • Ralf-Philipp Weinmann
  • Andrei Pyshkin
چکیده

We demonstrate an active attack on the WEP protocol that is able to recover a 104-bit WEP key using less than 40.000 frames with a success probability of 50%. In order to succeed in 95% of all cases, 85.000 packets are needed. The IV of these packets can be randomly chosen. This is an improvement in the number of required frames by more than an order of magnitude over the best known key-recovery attacks for WEP. On a IEEE 802.11g network, the number of frames required can be obtained by re-injection in less than a minute. The required computational effort is approximately 2 RC4 key setups, which on current desktop and laptop CPUs is neglegible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smashing WEP in a Passive Attack

In this paper, we report extremely fast and optimised active and passive attacks against the old IEEE 802.11 wireless communication protocol WEP. This was achieved through a huge amount of theoretical and experimental analysis (capturing WiFi packets), refinement and optimisation of all the former known attacks and methodologies against RC4 stream cipher in WEP mode. We support all our claims b...

متن کامل

Tornado Attack on RC4 with Applications to WEP & WPA

In this paper, we construct several tools for building and manipulating pools of biases in the analysis of RC4. We report extremely fast and optimized active and passive attacks against IEEE 802.11 wireless communication protocol WEP and a key recovery and a distinguishing attack against WPA. This was achieved through a huge amount of theoretical and experimental analysis (capturing WiFi packet...

متن کامل

TTM4137 Wireless Security Klein’s and PTW Attacks on WEP

These notes should help for an in-depth understanding of the paper [1] by Klein and [2] by Tews, Weinmann and Pyshkin. 1 Notation n 256; S array containing the numbers {0, ..., n− 1} in some order. Each number is present only once. S is also called a permutation; Si RC4 internal permutation S after the i-th RC4 round. 1 ≤ i ≤ n corresponds to the key setup algorithm, while i > n is the key stre...

متن کامل

A Light Weight Enhancement to RC4 Based Security for Resource Constrained Wireless Devices

The Wired Equivalent Privacy (WEP) uses the 64 bit RC4 secret key stream cipher as its layer 2 security protocol. Although the underlying RC4 cipher is secure, the potential reuse of the same key stream by different frames is a weakness in the WEP. One enhancement to WEP is the Temporal Key Integrity Protocol (TKIP), which acts as a wrapper to the WEP protocol and uses a 128 bit RC4 encryption ...

متن کامل

A Survey of Wireless Network Security Protocols

Today, the majority of wireless networks hold some form of sensitive data that only authorized users are meant to access. As a result, communication networks must enforce some type of security protocols that will limit the users who have access to the network resources. To ensure that a network is secure, the network must be able to enforce two key concepts: data privacy and data integrity. Dat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2007  شماره 

صفحات  -

تاریخ انتشار 2007